Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes

The hyperplane separation bound is a lower on the extension complexity of polytope. It main tool in Rothvoß's proof an exponential for matching polytope (Rothvoß, 2017). We show that technique sensitive to choice slack matrix and does not improve upon best known bounds spanning tree completion time polytopes when applied their canonical matrices. Stronger may be obtained by appropriate rescalings redundancy.